/**
*      author: Y_Yao
*      created: 2025-04-19 20:02:40
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 9e18;
const int INF = 0x3f3f3f3f;

struct node
{
    int i,a;
};


void solve()
{
    int n;
    cin >> n;
    queue<node> q;
    for(int i = 1;i <= n;i++)
    {
        int op;
        cin >> op;
        if(op == 1)
        {
            int x;
            cin >> x;
            q.push({i,x});
        }
        else
        {
            auto t = q.front();
            q.pop();
            cout << t.a << endl;
        }
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    // cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}